/**
*      author: Y_Yao
*      created: 2025-05-10 20:03:47
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int N = 100 + 7;
int a[N];
int n,m;
unordered_map<int,int> mp;

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    int ans = 0;
    for(int i = 1;i <= n;i++)
    {
        ans++;
        if(a[i] <= m && mp.count(a[i]) == 0)
        {
            mp[a[i]]++;
        }
        if(mp.size() == m)
        {
            cout << n - i + 1 << endl;
            return;
        }
    }
    cout << 0 << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}